Discontinuity And The Lambek Calculus
نویسنده
چکیده
This paper is concerned with tile treatment of discontinuous constituency within Categorial Grammar. In particular, I address the problem of providing an adequate formalisation of categorial commctives l)rol)osed by Moortgat (1988), which are useful for handling certain forms of diseontimmus eonstitnency, l)espite some interesting proposals, a satisfactory logic for these e{mnectives has so far remained dnsive. I will provide such a h)gie, using an approach that falls within the general framework of labelled deductive systems (Gabbay, 1991), employing novel methods for reasoning ahout linear order in resource nsage. The approach is illusl;rated by linguistic al}plications for extraction, pied-piping and quanti[ieation.
منابع مشابه
Discontinuous Lambek Calculus
The search for a full treatment of wrapping in type logical grammar has been a task of long-standing. In this paper we present a calculus for discontinuity addressing this challenge, ω-DL. The calculus allows an unbounded number of points of discontinuity (hence the prefix ω-) and includes both deterministic and nondeterministic discontinuous connectives. We believe that it constitutes a genera...
متن کاملGeneralized Discontinuity
We define and study a calculus of discontinuity, a version of displacement calculus, which is a logic of segmented strings in exactly the same sense that the Lambek calculus is a logic of strings. Like the Lambek calculus, the displacement calculus is a sequence logic free of structural rules, and enjoys Cut-elimination and its corollaries: the subformula property, decidability, and the finite ...
متن کاملLambda Calculus Type Theory and Natural Language
The theory of continuity based on the Lambek Calculus is well-de-veloped, but we need a compatible extension to include discontinuity.Earlier work set out ingredients: hypersequent calculus and proof netsexpanded with parameter edges. This paper completes a preliminaryline by finalising proof nets for basic discontinuity (that with one pointof discontinuity) and proving ...
متن کاملEfficient Parsing with the Product-Free Lambek Calculus
This paper provides a parsing algorithm for the Lambek calculus which is polynomial time for a more general fragment of the Lambek calculus than any previously known algorithm. The algorithm runs in worst-case time O(n5) when restricted to a certain fragment of the Lambek calculus which is motivated by empirical analysis. In addition, a set of parameterized inputs are given, showing why the alg...
متن کاملEfficiently Parsing with the Product-Free Lambek Calculus
This paper provides a parsing algorithm for the Lambek calculus which is polynomial time for a more general fragment of the Lambek calculus than any previously known algorithm. The algorithm runs in worst-case time O(n5) when restricted to a certain fragment of the Lambek calculus which is motivated by empirical analysis. In addition, a set of parameterized inputs are given, showing why the alg...
متن کاملParsing CCGbank with the Lambek Calculus
This paper will analyze CCGbank, a corpus of CCG derivations, for use with the Lambek calculus. We also present a Java implementation of the parsing algorithm for the Lambek calculus presented in Fowler (2009) and the results of experiments using that algorithm to parse the categories in CCGbank. We conclude that the Lambek calculus is computationally tractable for this task and provide insight...
متن کامل